منابع مشابه
Imprecise Exceptions, Co-Inductively
In a recent paper, Peyton Jones et al. proposed a design for imprecise exceptions in the lazy functional programming language Haskell PJRH + 99]. The main contribution of the design was that it allowed the language to continue to enjoy its current rich algebra of transformations. However, it does not combine easily with other extensions, most notably that of concurrency. We present an alternati...
متن کاملImprecise Exceptions in Distributed Parallel Components
Modern microprocessors have sacrificed the exactness of exceptions for improved performance long ago. This is a side effect of reordering instructions so that the microprocessor can execute instructions which were not to be executed due to an exception. By throwing more circuits at the problem, microprocessors are designed so that they are able to roll back to the instruction causing the except...
متن کاملCompositionality Inductively, Co-inductively and Contextually
[[a]] = . . . [[b]] . . . for b a part of a (1) with the meaning function [[·]] appearing on both sides. (1) is commonly construed as a prescription for computing the meaning of a based on the parts of a and their mode of combination. As equality is symmetric, however, we can also read (1) from right to left, as a constraint on the meaning [[b]] of a term b that brings in the wider context wher...
متن کاملDeciding subset relationship of co-inductively defined set constants
Static analysis of different non-strict functional programming languages makes use of set constants like Top, Inf, and Bot denoting all expressions, all lists without a last Nil as tail, and all non-terminating programs, respectively. We use a set language that permits union, constructors and recursive definition of set constants with a greatest fixpoint semantics. This paper proves decidabilit...
متن کاملSgml and Exceptions Sgml and Exceptions
The Standard Generalized Markup Language (SGML) allows users to deene document type deenitions (DTDs), which are essentially extended context-free grammars in a notation that is similar to extended Backus{Naur form. The right-hand side of a production is called a content model and its semantics can be modiied by exceptions. We give precise deenitions of the semantics of exceptions and prove tha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 1999
ISSN: 1571-0661
DOI: 10.1016/s1571-0661(05)80288-9